Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel

نویسندگان

  • Zsigmond Nagy
  • Kenneth Zeger
چکیده

The capacity C(3) 0;1 of a 3-dimensional (0; 1) run length constrained channel is shown to satisfy 0:522501741838 C(3) 0;1 0:526880847825 . The authors are with the Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla CA 92093-0407. Email: fnagy,[email protected] . The research was supported in part by the National Science Foundation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity Bounds for the 3 - dimensional ( 0 ; 1 )

The capacity C (3) (0;1) of a 3-dimensional (0; 1) runlength constrained channel is shown to satisfy 0:522501741838 C (3) (0;1) 0:526880847825 .

متن کامل

Efficient Coding for a Two-Dimensional Runlength-Limited Constraint

Runlength-limited (d, k) constraints and codes are widely used in digital data recording and transmission applications. Generalizations of runlength constraints to two dimensions are of potential interest in page-oriented information storage systems. However, in contrast to the one-dimensional case, little is known about the information-theoretic properties of two-dimensional constraints or the...

متن کامل

An enumerative method for runlength-limited codes: permutation codes

Permutation codes, introduced by Slepian, were shown to perform well on an additive white Gaussian noise (AWGN) channel. Unfortunately, these codes required large lookup tables, making them quite complex to implement even though the maximum-likelihood decoder is very simple. In this correspondence, we present an enumeration scheme which encodes and decodes permutation codes with low complexity....

متن کامل

Capacity bounds for the three-dimensional (0, 1) run length limited channel

The capacity of a three-dimensional (0 1) run length constrained channel is shown to satisfy 0 522501741838 0 526880847825.

متن کامل

Braun and Janssen: On the Low-Frequency Suppression Performance of DC-Free Runlength-Limited Modulation Codes ON THE LOW-FREQUENCY SUPPRESSION PERFORMANCE OF DC-FREE RUNLENGTH-LIMITED MODULATION CODES

Basic trade-offs between the rate of combined DC-free runlength-limited (DCRLL) modulation codes and the amount of suppression of low-frequency components are presented. The main results are obtained by means of a numerical study of dependencies between statistical properties of ideal, ‘maxentropic’ DCRLL sequences. The numerical results are mathematically founded by proving the observed behavi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999